Balancing Exploration and Exploitation by an Elitist Ant System with Exponential Pheromone Deposition Rule

نویسندگان

  • Ayan Acharya
  • Deepyaman Maiti
  • Aritra Banerjee
  • Amit Konar
چکیده

The paper presents an exponential pheromone deposition rule to modify the basic ant system algorithm which employs constant deposition rule. A stability analysis using differential equation is carried out to find out the values of parameters that make the ant system dynamics stable for both kinds of deposition rule. A roadmap of connected cities is chosen as the problem environment where the shortest route between two given cities is required to be discovered. Simulations performed with both forms of deposition approach using Elitist Ant System model reveal that the exponential deposition approach outperforms the classical one by a large extent. Exhaustive experiments are also carried out to find out the optimum setting of different controlling parameters for exponential deposition approach and an empirical relationship between the major controlling parameters of the algorithm and some features of problem environment. KeywordsAnt Colony Optimization, Ant System, Elitist Ant System, Stability Analysis, Exponential Pheromone Deposition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Elitist-Ant System for Solving the Post-Enrolment Course Timetabling Problem

Ant System algorithms are nature-inspired population-based metaheuristics derived from the field of swarm intelligence. Seemingly, the ant system has a lack of search diversity control since it has only a global pheromone update that intensifies the search. Hence, one or more assistant mechanisms are required to strengthen the search of the ant system. Therefore, we propose, in this study, an e...

متن کامل

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

Limited amount of time and computational resources in industrial domain makes Ant Colony Optimization (ACO) a useful approach to find near optimal solutions in polynomial time for Nondeterministic Polynomial time (NP) problems. For dynamically changing graphs, such as in case of network routing and urban transportation systems which are based on Travelling Salesman Problem (TSP), the ant colony...

متن کامل

Improved Lower Limits for Pheromone Trails in Ant Colony Optimization

Ant Colony Optimization algorithms were inspired by the foraging behavior of ants that accumulate pheromone trails on the shortest paths to food. Some ACO algorithms employ pheromone trail limits to improve exploration and avoid stagnation by ensuring a non-zero probability of selection for all trails. The MAX-MIN Ant System (MMAS) sets explicit pheromone trail limits while the Ant Colony Syste...

متن کامل

Sensitive Ant Systems in Combinatorial Optimization

A new model based on the robust Ant Colony System (ACS) is introduced. The proposed Sensitive ACS (SACS) model extends ACS using the sensitive reaction of ants to pheromone trails. Each ant is endowed with a pheromone sensitivity level allowing different types of responses to pheromone trails. The SACS model facilitates a good balance between search exploitation and search exploration. Both ACS...

متن کامل

The role of multiple pheromones in food recruitment by ants.

In this paper we investigate the foraging activity of an invasive ant species, the big headed ant Pheidole megacephala. We establish that the ants' behavior is consistent with the use of two different pheromone signals, both of which recruit nestmates. Our experiments suggest that during exploration the ants deposit a long-lasting pheromone that elicits a weak recruitment of nestmates, while wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0811.0131  شماره 

صفحات  -

تاریخ انتشار 2008